Parallel Prefix Computation and Sorting on a Recursive Dual-Net

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net RDN(B) for k > 0 has (2no)/2 nodes and d0 + k links per node, where n0 and d0 are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on RDN(B), k > 0, are 2-2+2Tcomm(0) and 2 -2+2Tcomp(0), respectively, where Tcomm(0) and Tcomp(0) are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on RDN(B) is restricted on B = Qm where Qm is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in O((m2)) computation steps and O((km2)) communication steps, respectively. Keywords— Interconnection Networks, Algorithm, Parallel Prefix Computation, Sorting